a(a(b(b(x1)))) → b(b(b(a(a(a(x1))))))
a(c(x1)) → c(a(x1))
c(b(x1)) → b(c(x1))
↳ QTRS
↳ DependencyPairsProof
a(a(b(b(x1)))) → b(b(b(a(a(a(x1))))))
a(c(x1)) → c(a(x1))
c(b(x1)) → b(c(x1))
A(a(b(b(x1)))) → A(a(x1))
A(c(x1)) → A(x1)
A(a(b(b(x1)))) → A(x1)
A(a(b(b(x1)))) → A(a(a(x1)))
C(b(x1)) → C(x1)
A(c(x1)) → C(a(x1))
a(a(b(b(x1)))) → b(b(b(a(a(a(x1))))))
a(c(x1)) → c(a(x1))
c(b(x1)) → b(c(x1))
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
A(a(b(b(x1)))) → A(a(x1))
A(c(x1)) → A(x1)
A(a(b(b(x1)))) → A(x1)
A(a(b(b(x1)))) → A(a(a(x1)))
C(b(x1)) → C(x1)
A(c(x1)) → C(a(x1))
a(a(b(b(x1)))) → b(b(b(a(a(a(x1))))))
a(c(x1)) → c(a(x1))
c(b(x1)) → b(c(x1))
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDPOrderProof
↳ QDP
C(b(x1)) → C(x1)
a(a(b(b(x1)))) → b(b(b(a(a(a(x1))))))
a(c(x1)) → c(a(x1))
c(b(x1)) → b(c(x1))
The following pairs can be oriented strictly and are deleted.
The remaining pairs can at least be oriented weakly.
C(b(x1)) → C(x1)
The value of delta used in the strict ordering is 1/2.
POL(C(x1)) = (2)x_1
POL(b(x1)) = 1/4 + (7/2)x_1
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDPOrderProof
↳ QDP
↳ PisEmptyProof
↳ QDP
a(a(b(b(x1)))) → b(b(b(a(a(a(x1))))))
a(c(x1)) → c(a(x1))
c(b(x1)) → b(c(x1))
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDPOrderProof
A(a(b(b(x1)))) → A(a(x1))
A(c(x1)) → A(x1)
A(a(b(b(x1)))) → A(x1)
A(a(b(b(x1)))) → A(a(a(x1)))
a(a(b(b(x1)))) → b(b(b(a(a(a(x1))))))
a(c(x1)) → c(a(x1))
c(b(x1)) → b(c(x1))
The following pairs can be oriented strictly and are deleted.
The remaining pairs can at least be oriented weakly.
A(c(x1)) → A(x1)
Used ordering: Polynomial interpretation [25,35]:
A(a(b(b(x1)))) → A(a(x1))
A(a(b(b(x1)))) → A(x1)
A(a(b(b(x1)))) → A(a(a(x1)))
The value of delta used in the strict ordering is 16.
POL(c(x1)) = 4 + (2)x_1
POL(a(x1)) = x_1
POL(A(x1)) = (4)x_1
POL(b(x1)) = x_1
a(a(b(b(x1)))) → b(b(b(a(a(a(x1))))))
a(c(x1)) → c(a(x1))
c(b(x1)) → b(c(x1))
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDPOrderProof
↳ QDP
A(a(b(b(x1)))) → A(a(x1))
A(a(b(b(x1)))) → A(x1)
A(a(b(b(x1)))) → A(a(a(x1)))
a(a(b(b(x1)))) → b(b(b(a(a(a(x1))))))
a(c(x1)) → c(a(x1))
c(b(x1)) → b(c(x1))